disjoint paths
英 [dɪsˈdʒɔɪnt pɑːðz]
美 [dɪsˈdʒɔɪnt pæðz]
网络 不相交的路径
双语例句
- Disjoint paths weight accumulating algorithm is proved to be effective in correlation computing by analyzing the results of the experiments.
分析实验结果发现，不相交路径权值累积算法能有效计算网络成员关联度。 - Optical networks are more complicated than the traditional graph-theoretic networks with nodes and links, but their reliability can be effectively improved by the use of disjoint paths.
光网络比传统的包含节点、链路的图论网络更为复杂，使用分离路径能够有效地改善光网络的可靠性。 - Connecting u and v by b internally disjoint paths of length a, the resulting graphs is denoted by Pa. b.
用b条内部互不相交且长度皆为a的道路连接u、ν所得的图用Pa，b表示。 - SSPP firstly computes a minimum hop primary path for each connection request, and it follows to compute two SRLG disjoint and minimum cost backup paths for each sub-path on the primary path.
共享子通路保护为每条业务请求计算一条最短的工作路由，并为工作路由上每段子通路各计算两条共享风险链路组分离且代价最小的保护路由。 - The problem of finding link/ node disjoint paths satisfying multiple constraints is a major issue in this context. This problem faces many different concepts compared with the classical one-dimension disjoint paths problem.
如何建立两条链路/节点分离多约束路径是一个关键问题，这一问题与经典的一维测度下的分离路径问题有着很多概念上的不同。 - In particular, w-wide diameter on a graph deals with w vertex disjoint paths between a pair of two vertices of G.
而涉及图G中两点间w条内部不相交的路径的G的w-直径是G的直径的推广。 - For a given positive integer d, the symbol Ad ( D) denotes the maximum number of internally disjoint paths of length at most d between any two vertices with distance at least two in the network D;
对于给定的正整数d，Ad（D）表示网络D中任何距离至少为2的两顶点之间内点不交且长度都不超过d的路的最大条数； - The problem of link disjoint paths pair with QoS constraints was discussed. Two routing models about link dis-joint optimal paths pair with QoS constraints were constructed.
研究了QoS约束下的链路分离路径问题，建立了2种QoS约束下的链路分离优化路径问题的模型。